A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
نویسنده
چکیده
We prove the main conjecture of the paper “On the expected value of the minimum assignment” by Marshall W. Buck, Clara S. Chan, and David P. Robbins [Random Structures Algorithms 21 (2002), 33–58]. This is an exact formula for the expected value of a certain type of random assignment problem. It generalizes the formula 1 + 1/4 + · · · + 1/n2 for the n by n exp(1) random assignment problem. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 26, 237–251, 2005
منابع مشابه
A Proof of a Conjecture of Buck, Chan and Robbins on the Random Assignment Problem
We prove the main conjecture of the paper “On the expected value of the minimum assignment” by Marshall W. Buck, Clara S. Chan, and David P. Robbins (Random Structures & Algorithms 21 (2002), no. 1, 33–58). This is a vast generalization of a formula conjectured by Giorgio Parisi for the n by n random assignment problem. 1. The Parisi formula This work is motivated by a conjecture made in 1998 b...
متن کاملOn the expected value of the minimum assignment
The minimum k-assignment of an m×n matrix X is the minimum sum of k entries of X, no two of which belong to the same row or column. If X is generated by choosing each entry independently from the exponential distribution with mean 1, then Coppersmith and Sorkin conjectured that the expected value of its minimum k-assignment is
متن کاملThe Blind Passenger and the Assignment Problem
We introduce a discrete random process which we call the passenger model, and show that it is connected to a certain random model of the assignment problem and in particular to the so-called Buck–Chan–Robbins urn process. We propose a conjecture on the distribution of the location of the minimum cost assignment in a cost matrix with zeros at specified positions and remaining entries of exponent...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملOn the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture
The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 26 شماره
صفحات -
تاریخ انتشار 2005